0.09/0.15	% Problem    : SLH615^1 : TPTP v7.5.0. Released v7.5.0.
0.09/0.16	% Command    : run_E %s %d THM
0.18/0.39	% Computer : n026.cluster.edu
0.18/0.39	% Model    : x86_64 x86_64
0.18/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.18/0.39	% Memory   : 8042.1875MB
0.18/0.39	% OS       : Linux 3.10.0-693.el7.x86_64
0.18/0.39	% CPULimit   : 30
0.18/0.39	% WCLimit    : 30
0.18/0.39	% DateTime   : Tue Aug  9 03:32:04 EDT 2022
0.18/0.39	% CPUTime    : 
0.25/0.54	The problem SPC is TH0_THM_EQU_NAR
0.25/0.55	Running higher-order on 1 cores theorem proving
0.25/0.55	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.25/0.55	# Version: 3.0pre003-ho
1.27/1.44	# Preprocessing class: HSLSSMSSSSSNSFA.
1.27/1.44	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
1.27/1.44	# Starting new_ho_11 with 30s (1) cores
1.27/1.44	# new_ho_11 with pid 9943 completed with status 0
1.27/1.44	# Result found by new_ho_11
1.27/1.44	# Preprocessing class: HSLSSMSSSSSNSFA.
1.27/1.44	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
1.27/1.44	# Starting new_ho_11 with 30s (1) cores
1.27/1.44	# No SInE strategy applied
1.27/1.44	# Search class: HGHSM-FSLM31-MSFFFFBN
1.27/1.44	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
1.27/1.44	# Starting new_ho_10 with 17s (1) cores
1.27/1.44	# new_ho_10 with pid 9944 completed with status 0
1.27/1.44	# Result found by new_ho_10
1.27/1.44	# Preprocessing class: HSLSSMSSSSSNSFA.
1.27/1.44	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
1.27/1.44	# Starting new_ho_11 with 30s (1) cores
1.27/1.44	# No SInE strategy applied
1.27/1.44	# Search class: HGHSM-FSLM31-MSFFFFBN
1.27/1.44	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
1.27/1.44	# Starting new_ho_10 with 17s (1) cores
1.27/1.44	# Preprocessing time       : 0.004 s
1.27/1.44	# Presaturation interreduction done
1.27/1.44	
1.27/1.44	# Proof found!
1.27/1.44	# SZS status Theorem
1.27/1.44	# SZS output start CNFRefutation
1.27/1.44	thf(decl_22, type, fun_upd_nat_nat: (nat > nat) > nat > nat > nat > nat).
1.27/1.44	thf(decl_23, type, minus_minus_nat: nat > nat > nat).
1.27/1.44	thf(decl_24, type, one_one_nat: nat).
1.27/1.44	thf(decl_25, type, times_times_nat: nat > nat > nat).
1.27/1.44	thf(decl_26, type, times_times_num: num > num > num).
1.27/1.44	thf(decl_27, type, zero_zero_nat: nat).
1.27/1.44	thf(decl_28, type, bit0: num > num).
1.27/1.44	thf(decl_29, type, one: num).
1.27/1.44	thf(decl_30, type, numeral_numeral_nat: num > nat).
1.27/1.44	thf(decl_31, type, number1551313001itions: (nat > nat) > nat > $o).
1.27/1.44	thf(decl_32, type, ord_less_nat: nat > nat > $o).
1.27/1.44	thf(decl_33, type, ord_less_num: num > num > $o).
1.27/1.44	thf(decl_34, type, ord_less_eq_nat: nat > nat > $o).
1.27/1.44	thf(decl_35, type, ord_less_eq_num: num > num > $o).
1.27/1.44	thf(decl_36, type, i: nat).
1.27/1.44	thf(decl_37, type, k: nat).
1.27/1.44	thf(decl_38, type, n: nat).
1.27/1.44	thf(decl_39, type, p: nat > nat).
1.27/1.44	thf(decl_40, type, esk1_1: (nat > $o) > nat).
1.27/1.44	thf(decl_41, type, esk2_1: (nat > $o) > nat).
1.27/1.44	thf(decl_42, type, esk3_2: (nat > $o) > nat > nat).
1.27/1.44	thf(decl_43, type, esk4_1: (nat > $o) > nat).
1.27/1.44	thf(decl_44, type, esk5_1: (nat > nat) > nat).
1.27/1.44	thf(decl_45, type, esk6_2: (nat > $o) > nat > nat).
1.27/1.44	thf(decl_46, type, esk7_1: (nat > $o) > nat).
1.27/1.44	thf(decl_47, type, esk8_1: (nat > nat) > nat).
1.27/1.44	thf(decl_48, type, esk9_1: (nat > nat) > nat).
1.27/1.44	thf(fact_112_mult_Ocommute, axiom, ((times_times_nat)=(^[X29:nat, X30:nat]:(times_times_nat @ X30 @ X29))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_112_mult_Ocommute)).
1.27/1.44	thf(fact_49_le__trans, axiom, ![X14:nat, X15:nat, X13:nat]:(((ord_less_eq_nat @ X14 @ X15)=>((ord_less_eq_nat @ X15 @ X13)=>(ord_less_eq_nat @ X14 @ X13)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_49_le__trans)).
1.27/1.44	thf(fact_1__092_060open_0622_A_K_Ak_A_092_060le_062_Ap_Ak_A_K_Ak_092_060close_062, axiom, (ord_less_eq_nat @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ k) @ (times_times_nat @ (p @ k) @ k)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1__092_060open_0622_A_K_Ak_A_092_060le_062_Ap_Ak_A_K_Ak_092_060close_062)).
1.27/1.44	thf(fact_9_less__not__refl, axiom, ![X2:nat]:(~((ord_less_nat @ X2 @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_9_less__not__refl)).
1.27/1.44	thf(fact_102_less__or__eq__imp__le, axiom, ![X1:nat, X2:nat]:((((ord_less_nat @ X1 @ X2)|((X1)=(X2)))=>(ord_less_eq_nat @ X1 @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_102_less__or__eq__imp__le)).
1.27/1.44	thf(fact_38_zero__less__diff, axiom, ![X2:nat, X1:nat]:(((ord_less_nat @ zero_zero_nat @ (minus_minus_nat @ X2 @ X1))<=>(ord_less_nat @ X1 @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_38_zero__less__diff)).
1.27/1.44	thf(fact_41_diff__is__0__eq, axiom, ![X1:nat, X2:nat]:((((minus_minus_nat @ X1 @ X2)=(zero_zero_nat))<=>(ord_less_eq_nat @ X1 @ X2))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_41_diff__is__0__eq)).
1.27/1.44	thf(fact_0__092_060open_062n_A_060_A2_A_K_Ak_092_060close_062, axiom, (ord_less_nat @ n @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ k)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0__092_060open_062n_A_060_A2_A_K_Ak_092_060close_062)).
1.27/1.44	thf(conj_0, conjecture, (ord_less_nat @ n @ (times_times_nat @ (p @ k) @ k)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
1.27/1.44	thf(fact_101_le__neq__implies__less, axiom, ![X1:nat, X2:nat]:(((ord_less_eq_nat @ X1 @ X2)=>(((X1)!=(X2))=>(ord_less_nat @ X1 @ X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_101_le__neq__implies__less)).
1.27/1.44	thf(c_0_10, plain, ![X433:nat, X434:nat]:(((times_times_nat @ X433 @ X434)=(times_times_nat @ X434 @ X433))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_112_mult_Ocommute])])).
1.27/1.44	thf(c_0_11, plain, ![X646:nat, X647:nat]:(((times_times_nat @ X646 @ X647)=(times_times_nat @ X647 @ X646))), inference(variable_rename,[status(thm)],[c_0_10])).
1.27/1.44	thf(c_0_12, plain, ![X503:nat, X504:nat, X505:nat]:((~(ord_less_eq_nat @ X503 @ X504)|(~(ord_less_eq_nat @ X504 @ X505)|(ord_less_eq_nat @ X503 @ X505)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_49_le__trans])])).
1.27/1.44	thf(c_0_13, plain, (ord_less_eq_nat @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ k) @ (times_times_nat @ (p @ k) @ k)), inference(split_conjunct,[status(thm)],[fact_1__092_060open_0622_A_K_Ak_A_092_060le_062_Ap_Ak_A_K_Ak_092_060close_062])).
1.27/1.44	thf(c_0_14, plain, ![X2:nat, X1:nat]:(((times_times_nat @ X1 @ X2)=(times_times_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
1.27/1.44	thf(c_0_15, plain, ![X2:nat]:(~(ord_less_nat @ X2 @ X2)), inference(fof_simplification,[status(thm)],[fact_9_less__not__refl])).
1.27/1.44	thf(c_0_16, plain, ![X1:nat, X2:nat, X3:nat]:(((ord_less_eq_nat @ X1 @ X3)|~((ord_less_eq_nat @ X1 @ X2))|~((ord_less_eq_nat @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_12])).
1.27/1.44	thf(c_0_17, plain, (ord_less_eq_nat @ (times_times_nat @ k @ (numeral_numeral_nat @ (bit0 @ one))) @ (times_times_nat @ k @ (p @ k))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13, c_0_14]), c_0_14])).
1.27/1.44	thf(c_0_18, plain, ![X623:nat, X624:nat]:(((~(ord_less_nat @ X623 @ X624)|(ord_less_eq_nat @ X623 @ X624))&(((X623)!=(X624))|(ord_less_eq_nat @ X623 @ X624)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_102_less__or__eq__imp__le])])])).
1.27/1.44	thf(c_0_19, plain, ![X485:nat, X486:nat]:(((~(ord_less_nat @ zero_zero_nat @ (minus_minus_nat @ X485 @ X486))|(ord_less_nat @ X486 @ X485))&(~(ord_less_nat @ X486 @ X485)|(ord_less_nat @ zero_zero_nat @ (minus_minus_nat @ X485 @ X486))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_38_zero__less__diff])])).
1.27/1.44	thf(c_0_20, plain, ![X492:nat, X493:nat]:(((((minus_minus_nat @ X492 @ X493)!=(zero_zero_nat))|(ord_less_eq_nat @ X492 @ X493))&(~(ord_less_eq_nat @ X492 @ X493)|((minus_minus_nat @ X492 @ X493)=(zero_zero_nat))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_41_diff__is__0__eq])])).
1.27/1.44	thf(c_0_21, plain, ![X437:nat]:(~(ord_less_nat @ X437 @ X437)), inference(variable_rename,[status(thm)],[c_0_15])).
1.27/1.44	thf(c_0_22, plain, ![X1:nat]:(((ord_less_eq_nat @ X1 @ (times_times_nat @ k @ (p @ k)))|~((ord_less_eq_nat @ X1 @ (times_times_nat @ k @ (numeral_numeral_nat @ (bit0 @ one))))))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
1.27/1.44	thf(c_0_23, plain, ![X1:nat, X2:nat]:(((ord_less_eq_nat @ X1 @ X2)|~((ord_less_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_18])).
1.27/1.44	thf(c_0_24, plain, (ord_less_nat @ n @ (times_times_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ k)), inference(split_conjunct,[status(thm)],[fact_0__092_060open_062n_A_060_A2_A_K_Ak_092_060close_062])).
1.27/1.44	thf(c_0_25, negated_conjecture, ~(ord_less_nat @ n @ (times_times_nat @ (p @ k) @ k)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
1.27/1.44	thf(c_0_26, plain, ![X1:nat, X2:nat]:(((ord_less_nat @ zero_zero_nat @ (minus_minus_nat @ X2 @ X1))|~((ord_less_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_19])).
1.27/1.44	thf(c_0_27, plain, ![X1:nat, X2:nat]:((((minus_minus_nat @ X1 @ X2)=(zero_zero_nat))|~((ord_less_eq_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_20])).
1.27/1.44	thf(c_0_28, plain, ![X1:nat]:(~((ord_less_nat @ X1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_21])).
1.27/1.44	thf(c_0_29, plain, ![X621:nat, X622:nat]:((~(ord_less_eq_nat @ X621 @ X622)|(((X621)=(X622))|(ord_less_nat @ X621 @ X622)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_101_le__neq__implies__less])])).
1.27/1.44	thf(c_0_30, plain, ![X1:nat]:(((ord_less_eq_nat @ X1 @ (times_times_nat @ k @ (p @ k)))|~((ord_less_nat @ X1 @ (times_times_nat @ k @ (numeral_numeral_nat @ (bit0 @ one))))))), inference(spm,[status(thm)],[c_0_22, c_0_23])).
1.27/1.44	thf(c_0_31, plain, (ord_less_nat @ n @ (times_times_nat @ k @ (numeral_numeral_nat @ (bit0 @ one)))), inference(rw,[status(thm)],[c_0_24, c_0_14])).
1.27/1.44	thf(c_0_32, negated_conjecture, ~((ord_less_nat @ n @ (times_times_nat @ (p @ k) @ k))), inference(split_conjunct,[status(thm)],[c_0_25])).
1.27/1.44	thf(c_0_33, plain, ![X2:nat, X1:nat]:((~((ord_less_nat @ X1 @ X2))|~((ord_less_eq_nat @ X2 @ X1)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
1.27/1.44	thf(c_0_34, plain, ![X1:nat, X2:nat]:((((X1)=(X2))|(ord_less_nat @ X1 @ X2)|~((ord_less_eq_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_29])).
1.27/1.44	thf(c_0_35, plain, (ord_less_eq_nat @ n @ (times_times_nat @ k @ (p @ k))), inference(spm,[status(thm)],[c_0_30, c_0_31])).
1.27/1.44	thf(c_0_36, negated_conjecture, ~((ord_less_nat @ n @ (times_times_nat @ k @ (p @ k)))), inference(rw,[status(thm)],[c_0_32, c_0_14])).
1.27/1.44	thf(c_0_37, plain, ~((ord_less_nat @ (times_times_nat @ k @ (p @ k)) @ (times_times_nat @ k @ (numeral_numeral_nat @ (bit0 @ one))))), inference(spm,[status(thm)],[c_0_33, c_0_17])).
1.27/1.44	thf(c_0_38, plain, ((times_times_nat @ k @ (p @ k))=(n)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])).
1.27/1.44	thf(c_0_39, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_38]), c_0_31])]), ['proof']).
1.27/1.44	# SZS output end CNFRefutation
1.27/1.44	# Parsed axioms                        : 220
1.27/1.44	# Removed by relevancy pruning/SinE    : 0
1.27/1.44	# Initial clauses                      : 300
1.27/1.44	# Removed in clause preprocessing      : 35
1.27/1.44	# Initial clauses in saturation        : 265
1.27/1.44	# Processed clauses                    : 3553
1.27/1.44	# ...of these trivial                  : 71
1.27/1.44	# ...subsumed                          : 2332
1.27/1.44	# ...remaining for further processing  : 1150
1.27/1.44	# Other redundant clauses eliminated   : 139
1.27/1.44	# Clauses deleted for lack of memory   : 0
1.27/1.44	# Backward-subsumed                    : 46
1.27/1.44	# Backward-rewritten                   : 48
1.27/1.44	# Generated clauses                    : 60732
1.27/1.44	# ...of the previous two non-redundant : 52784
1.27/1.44	# ...aggressively subsumed             : 0
1.27/1.44	# Contextual simplify-reflections      : 36
1.27/1.44	# Paramodulations                      : 60567
1.27/1.44	# Factorizations                       : 4
1.27/1.44	# NegExts                              : 0
1.27/1.44	# Equation resolutions                 : 160
1.27/1.44	# Propositional unsat checks           : 0
1.27/1.44	#    Propositional check models        : 0
1.27/1.44	#    Propositional check unsatisfiable : 0
1.27/1.44	#    Propositional clauses             : 0
1.27/1.44	#    Propositional clauses after purity: 0
1.27/1.44	#    Propositional unsat core size     : 0
1.27/1.44	#    Propositional preprocessing time  : 0.000
1.27/1.44	#    Propositional encoding time       : 0.000
1.27/1.44	#    Propositional solver time         : 0.000
1.27/1.44	#    Success case prop preproc time    : 0.000
1.27/1.44	#    Success case prop encoding time   : 0.000
1.27/1.44	#    Success case prop solver time     : 0.000
1.27/1.44	# Current number of processed clauses  : 883
1.27/1.44	#    Positive orientable unit clauses  : 85
1.27/1.44	#    Positive unorientable unit clauses: 5
1.27/1.44	#    Negative unit clauses             : 73
1.27/1.44	#    Non-unit-clauses                  : 720
1.27/1.44	# Current number of unprocessed clauses: 49473
1.27/1.44	# ...number of literals in the above   : 174858
1.27/1.44	# Current number of archived formulas  : 0
1.27/1.44	# Current number of archived clauses   : 232
1.27/1.44	# Clause-clause subsumption calls (NU) : 77778
1.27/1.44	# Rec. Clause-clause subsumption calls : 57868
1.27/1.44	# Non-unit clause-clause subsumptions  : 1271
1.27/1.44	# Unit Clause-clause subsumption calls : 8566
1.27/1.44	# Rewrite failures with RHS unbound    : 0
1.27/1.44	# BW rewrite match attempts            : 157
1.27/1.44	# BW rewrite match successes           : 88
1.27/1.44	# Condensation attempts                : 3553
1.27/1.44	# Condensation successes               : 104
1.27/1.44	# Termbank termtop insertions          : 847973
1.27/1.44	
1.27/1.44	# -------------------------------------------------
1.27/1.44	# User time                : 0.860 s
1.27/1.44	# System time              : 0.025 s
1.27/1.44	# Total time               : 0.885 s
1.27/1.44	# Maximum resident set size: 2812 pages
1.27/1.44	
1.27/1.44	# -------------------------------------------------
1.27/1.44	# User time                : 0.865 s
1.27/1.44	# System time              : 0.028 s
1.27/1.44	# Total time               : 0.894 s
1.27/1.44	# Maximum resident set size: 1852 pages
1.27/1.44	EOF